0.04/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.04/0.12	% Command    : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC
0.13/0.33	% Computer   : n011.cluster.edu
0.13/0.33	% Model      : x86_64 x86_64
0.13/0.33	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.33	% Memory     : 8042.1875MB
0.13/0.33	% OS         : Linux 3.10.0-693.el7.x86_64
0.13/0.33	% CPULimit   : 1200
0.13/0.33	% WCLimit    : 120
0.13/0.33	% DateTime   : Tue Jul 13 10:59:25 EDT 2021
0.13/0.34	% CPUTime    : 
0.13/0.34	% Number of cores: 8
0.13/0.34	% Python version: Python 3.6.8
0.13/0.34	# Version: 2.6rc1-ho
0.13/0.34	# No SInE strategy applied
0.13/0.34	# Trying AutoSched0 for 59 seconds
0.20/0.37	# AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S065A
0.20/0.37	# and selection function SelectComplexAHP.
0.20/0.37	#
0.20/0.37	# Preprocessing time       : 0.030 s
0.20/0.37	# Presaturation interreduction done
0.20/0.37	
0.20/0.37	# Proof found!
0.20/0.37	# SZS status Theorem
0.20/0.37	# SZS output start CNFRefutation
0.20/0.37	thf(mbox, axiom, (mbox)=(^[X24:$i > $o, X25:$i]:![X26:$i]:(~(rel @ X25 @ X26)|X24 @ X26)), file('/export/starexec/sandbox/benchmark/Axioms/LCL016^0.ax', mbox)).
0.20/0.37	thf(mbox_generic, axiom, (mbox_generic)=(^[X15:$i > $i > $o, X4:$i > $o, X3:$i]:![X16:$i]:(~(X15 @ X3 @ X16)|X4 @ X16)), file('/export/starexec/sandbox/benchmark/Axioms/LCL016^0.ax', mbox_generic)).
0.20/0.37	thf(mdia, axiom, (mdia)=(^[X27:$i > $o, X28:$i]:?[X29:$i]:(rel @ X28 @ X29&X27 @ X29)), file('/export/starexec/sandbox/benchmark/Axioms/LCL016^0.ax', mdia)).
0.20/0.37	thf(mdia_generic, axiom, (mdia_generic)=(^[X15:$i > $i > $o, X4:$i > $o, X3:$i]:?[X16:$i]:(X15 @ X3 @ X16&X4 @ X16)), file('/export/starexec/sandbox/benchmark/Axioms/LCL016^0.ax', mdia_generic)).
0.20/0.37	thf(mexists_eiw_ind, axiom, (mexists_eiw_ind)=(^[X18:mu > $i > $o, X34:$i]:~(![X37:mu]:(eiw_ind @ X34 @ X37=>~(X18 @ X37 @ X34)))), file('/export/starexec/sandbox/benchmark/Axioms/LCL017^1.ax', mexists_eiw_ind)).
0.20/0.37	thf(mnot, axiom, (mnot)=(^[X4:$i > $o, X3:$i]:~(X4 @ X3)), file('/export/starexec/sandbox/benchmark/Axioms/LCL016^0.ax', mnot)).
0.20/0.37	thf(mforall_eiw_ind, axiom, (mforall_eiw_ind)=(^[X17:mu > $i > $o, X3:$i]:![X1:mu]:(eiw_ind @ X3 @ X1=>X17 @ X1 @ X3)), file('/export/starexec/sandbox/benchmark/Axioms/LCL017^1.ax', mforall_eiw_ind)).
0.20/0.37	thf(axii, axiom, mvalid @ (mforall_indset @ (^[X19:mu > $i > $o]:mforall_indset @ (^[X20:mu > $i > $o]:mimplies @ (mbox @ (mforall_eiw_ind @ (^[X1:mu]:mequiv @ (X19 @ X1) @ (X20 @ X1)))) @ (mequiv @ (p @ X19) @ (p @ X20))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', axii)).
0.20/0.37	thf(mimplies, axiom, (mimplies)=(^[X4:$i > $o, X5:$i > $o, X3:$i]:(X4 @ X3=>X5 @ X3)), file('/export/starexec/sandbox/benchmark/Axioms/LCL016^0.ax', mimplies)).
0.20/0.37	thf(mequiv, axiom, (mequiv)=(^[X4:$i > $o, X5:$i > $o, X3:$i]:(X4 @ X3<=>X5 @ X3)), file('/export/starexec/sandbox/benchmark/Axioms/LCL016^0.ax', mequiv)).
0.20/0.37	thf(mforall_indset, axiom, (mforall_indset)=(^[X7:(mu > $i > $o) > $i > $o, X3:$i]:![X8:mu > $i > $o]:X7 @ X8 @ X3), file('/export/starexec/sandbox/benchmark/Axioms/LCL016^0.ax', mforall_indset)).
0.20/0.37	thf(mvalid, axiom, (mvalid)=(^[X4:$i > $o]:![X3:$i]:X4 @ X3), file('/export/starexec/sandbox/benchmark/Axioms/LCL016^0.ax', mvalid)).
0.20/0.37	thf(possible_instantiation_of_the_positive_variable_domain, conjecture, mvalid @ (mforall_indset @ (^[X21:mu > $i > $o]:mimplies @ (p @ X21) @ (mdia @ (mexists_eiw_ind @ (^[X1:mu]:X21 @ X1))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', possible_instantiation_of_the_positive_variable_domain)).
0.20/0.37	thf(ax16, axiom, mvalid @ (mnot @ (p @ (^[X1:mu, X3:$i]:(X1)!=(X1)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', ax16)).
0.20/0.37	thf(c_0_14, axiom, (mbox)=(^[X24:$i > $o, X25:$i]:![X26:$i]:(~(rel @ X25 @ X26)|X24 @ X26)), inference(apply_def,[status(thm)],[mbox, mbox_generic])).
0.20/0.37	thf(c_0_15, axiom, (mdia)=(^[X27:$i > $o, X28:$i]:?[X29:$i]:(rel @ X28 @ X29&X27 @ X29)), inference(apply_def,[status(thm)],[mdia, mdia_generic])).
0.20/0.37	thf(c_0_16, axiom, (mexists_eiw_ind)=(^[X18:mu > $i > $o, X34:$i]:~(![X37:mu]:(eiw_ind @ X34 @ X37=>~(X18 @ X37 @ X34)))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[mexists_eiw_ind, mnot]), mforall_eiw_ind])).
0.20/0.37	thf(c_0_17, plain, ![X80:$i, X86:mu > $i > $o, X87:mu > $i > $o]:(![X88:$i]:(~rel @ X80 @ X88|![X89:mu]:(eiw_ind @ X88 @ X89=>(X86 @ X89 @ X88<=>X87 @ X89 @ X88)))=>(p @ X86 @ X80<=>p @ X87 @ X80)), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[axii, mimplies]), mequiv]), mforall_indset]), c_0_14]), mvalid]), mforall_eiw_ind])])).
0.20/0.37	thf(c_0_18, negated_conjecture, ~(![X112:$i, X117:mu > $i > $o]:(p @ X117 @ X112=>?[X118:$i]:(rel @ X112 @ X118&~(![X119:mu]:(eiw_ind @ X118 @ X119=>~X117 @ X119 @ X118))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[possible_instantiation_of_the_positive_variable_domain]), mimplies]), mforall_indset]), c_0_15]), mvalid]), c_0_16])])).
0.20/0.37	thf(c_0_19, plain, ![X123:$i, X124:mu > $i > $o, X125:mu > $i > $o]:(((~p @ X124 @ X123|p @ X125 @ X123|rel @ X123 @ (esk2_3 @ X123 @ X124 @ X125))&(~p @ X125 @ X123|p @ X124 @ X123|rel @ X123 @ (esk2_3 @ X123 @ X124 @ X125)))&(((~p @ X124 @ X123|p @ X125 @ X123|eiw_ind @ (esk2_3 @ X123 @ X124 @ X125) @ (esk3_3 @ X123 @ X124 @ X125))&(~p @ X125 @ X123|p @ X124 @ X123|eiw_ind @ (esk2_3 @ X123 @ X124 @ X125) @ (esk3_3 @ X123 @ X124 @ X125)))&(((~p @ X124 @ X123|p @ X125 @ X123|(~X124 @ (esk3_3 @ X123 @ X124 @ X125) @ (esk2_3 @ X123 @ X124 @ X125)|~X125 @ (esk3_3 @ X123 @ X124 @ X125) @ (esk2_3 @ X123 @ X124 @ X125)))&(~p @ X125 @ X123|p @ X124 @ X123|(~X124 @ (esk3_3 @ X123 @ X124 @ X125) @ (esk2_3 @ X123 @ X124 @ X125)|~X125 @ (esk3_3 @ X123 @ X124 @ X125) @ (esk2_3 @ X123 @ X124 @ X125))))&((~p @ X124 @ X123|p @ X125 @ X123|(X124 @ (esk3_3 @ X123 @ X124 @ X125) @ (esk2_3 @ X123 @ X124 @ X125)|X125 @ (esk3_3 @ X123 @ X124 @ X125) @ (esk2_3 @ X123 @ X124 @ X125)))&(~p @ X125 @ X123|p @ X124 @ X123|(X124 @ (esk3_3 @ X123 @ X124 @ X125) @ (esk2_3 @ X123 @ X124 @ X125)|X125 @ (esk3_3 @ X123 @ X124 @ X125) @ (esk2_3 @ X123 @ X124 @ X125))))))), inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])])])])).
0.20/0.37	thf(c_0_20, negated_conjecture, ![X130:$i, X131:mu]:(p @ epred2_0 @ esk4_0&(~rel @ esk4_0 @ X130|(~eiw_ind @ X130 @ X131|~epred2_0 @ X131 @ X130))), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_18])])])])).
0.20/0.37	thf(c_0_21, plain, ![X8:mu > $i > $o, X6:mu > $i > $o, X3:$i]:(p @ X8 @ X3|rel @ X3 @ (esk2_3 @ X3 @ X8 @ X6)|~p @ X6 @ X3), inference(split_conjunct,[status(thm)],[c_0_19])).
0.20/0.37	thf(c_0_22, negated_conjecture, p @ epred2_0 @ esk4_0, inference(split_conjunct,[status(thm)],[c_0_20])).
0.20/0.37	thf(c_0_23, plain, ![X44:$i, X43:mu]:(epred1_2 @ X43 @ X44<=>(X43)!=(X43)), introduced(definition)).
0.20/0.37	thf(c_0_24, negated_conjecture, ![X1:mu, X3:$i]:(~rel @ esk4_0 @ X3|~eiw_ind @ X3 @ X1|~epred2_0 @ X1 @ X3), inference(split_conjunct,[status(thm)],[c_0_20])).
0.20/0.37	thf(c_0_25, negated_conjecture, ![X6:mu > $i > $o]:(rel @ esk4_0 @ (esk2_3 @ esk4_0 @ X6 @ epred2_0)|p @ X6 @ esk4_0), inference(spm,[status(thm)],[c_0_21, c_0_22])).
0.20/0.37	thf(c_0_26, plain, ![X8:mu > $i > $o, X6:mu > $i > $o, X3:$i]:(p @ X8 @ X3|eiw_ind @ (esk2_3 @ X3 @ X8 @ X6) @ (esk3_3 @ X3 @ X8 @ X6)|~p @ X6 @ X3), inference(split_conjunct,[status(thm)],[c_0_19])).
0.20/0.37	thf(c_0_27, plain, ![X132:$i, X133:mu]:((~epred1_2 @ X133 @ X132|(X133)!=(X133))&((X133)=(X133)|epred1_2 @ X133 @ X132)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_23])])).
0.20/0.37	thf(c_0_28, negated_conjecture, ![X1:mu, X6:mu > $i > $o]:(p @ X6 @ esk4_0|~eiw_ind @ (esk2_3 @ esk4_0 @ X6 @ epred2_0) @ X1|~epred2_0 @ X1 @ (esk2_3 @ esk4_0 @ X6 @ epred2_0)), inference(spm,[status(thm)],[c_0_24, c_0_25])).
0.20/0.37	thf(c_0_29, negated_conjecture, ![X6:mu > $i > $o]:(eiw_ind @ (esk2_3 @ esk4_0 @ X6 @ epred2_0) @ (esk3_3 @ esk4_0 @ X6 @ epred2_0)|p @ X6 @ esk4_0), inference(spm,[status(thm)],[c_0_26, c_0_22])).
0.20/0.37	thf(c_0_30, plain, ![X40:$i]:~p @ epred1_2 @ X40, inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[ax16, mnot]), mvalid]), c_0_23])])).
0.20/0.37	thf(c_0_31, plain, ![X3:$i, X1:mu]:(~epred1_2 @ X1 @ X3|(X1)!=(X1)), inference(split_conjunct,[status(thm)],[c_0_27])).
0.20/0.37	thf(c_0_32, plain, ![X8:mu > $i > $o, X6:mu > $i > $o, X3:$i]:(p @ X8 @ X3|X8 @ (esk3_3 @ X3 @ X8 @ X6) @ (esk2_3 @ X3 @ X8 @ X6)|X6 @ (esk3_3 @ X3 @ X8 @ X6) @ (esk2_3 @ X3 @ X8 @ X6)|~p @ X6 @ X3), inference(split_conjunct,[status(thm)],[c_0_19])).
0.20/0.37	thf(c_0_33, negated_conjecture, ![X6:mu > $i > $o]:(p @ X6 @ esk4_0|~epred2_0 @ (esk3_3 @ esk4_0 @ X6 @ epred2_0) @ (esk2_3 @ esk4_0 @ X6 @ epred2_0)), inference(spm,[status(thm)],[c_0_28, c_0_29])).
0.20/0.37	thf(c_0_34, plain, ![X122:$i]:~p @ epred1_2 @ X122, inference(variable_rename,[status(thm)],[c_0_30])).
0.20/0.37	thf(c_0_35, plain, ![X1:mu, X3:$i]:~epred1_2 @ X1 @ X3, inference(cn,[status(thm)],[c_0_31])).
0.20/0.37	thf(c_0_36, negated_conjecture, ![X6:mu > $i > $o]:(X6 @ (esk3_3 @ esk4_0 @ X6 @ epred2_0) @ (esk2_3 @ esk4_0 @ X6 @ epred2_0)|p @ X6 @ esk4_0), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_32, c_0_22]), c_0_33])).
0.20/0.37	thf(c_0_37, plain, ![X3:$i]:~p @ epred1_2 @ X3, inference(split_conjunct,[status(thm)],[c_0_34])).
0.20/0.37	thf(c_0_38, plain, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_35, c_0_36]), c_0_37]), ['proof']).
0.20/0.37	# SZS output end CNFRefutation
0.20/0.37	# Proof object total steps             : 39
0.20/0.37	# Proof object clause steps            : 14
0.20/0.37	# Proof object formula steps           : 25
0.20/0.37	# Proof object conjectures             : 10
0.20/0.37	# Proof object clause conjectures      : 7
0.20/0.37	# Proof object formula conjectures     : 3
0.20/0.37	# Proof object initial clauses used    : 7
0.20/0.37	# Proof object initial formulas used   : 14
0.20/0.37	# Proof object generating inferences   : 6
0.20/0.37	# Proof object simplifying inferences  : 3
0.20/0.37	# Training examples: 0 positive, 0 negative
0.20/0.37	# Parsed axioms                        : 56
0.20/0.37	# Removed by relevancy pruning/SinE    : 0
0.20/0.37	# Initial clauses                      : 42
0.20/0.37	# Removed in clause preprocessing      : 29
0.20/0.37	# Initial clauses in saturation        : 13
0.20/0.37	# Processed clauses                    : 47
0.20/0.37	# ...of these trivial                  : 0
0.20/0.37	# ...subsumed                          : 4
0.20/0.37	# ...remaining for further processing  : 43
0.20/0.37	# Other redundant clauses eliminated   : 11
0.20/0.37	# Clauses deleted for lack of memory   : 0
0.20/0.37	# Backward-subsumed                    : 0
0.20/0.37	# Backward-rewritten                   : 0
0.20/0.37	# Generated clauses                    : 54
0.20/0.37	# ...of the previous two non-trivial   : 22
0.20/0.37	# Contextual simplify-reflections      : 1
0.20/0.37	# Paramodulations                      : 19
0.20/0.37	# Factorizations                       : 0
0.20/0.37	# NegExts                              : 3
0.20/0.37	# Equation resolutions                 : 11
0.20/0.37	# Propositional unsat checks           : 0
0.20/0.37	#    Propositional check models        : 0
0.20/0.37	#    Propositional check unsatisfiable : 0
0.20/0.37	#    Propositional clauses             : 0
0.20/0.37	#    Propositional clauses after purity: 0
0.20/0.37	#    Propositional unsat core size     : 0
0.20/0.37	#    Propositional preprocessing time  : 0.000
0.20/0.37	#    Propositional encoding time       : 0.000
0.20/0.37	#    Propositional solver time         : 0.000
0.20/0.37	#    Success case prop preproc time    : 0.000
0.20/0.37	#    Success case prop encoding time   : 0.000
0.20/0.37	#    Success case prop solver time     : 0.000
0.20/0.37	# Current number of processed clauses  : 28
0.20/0.37	#    Positive orientable unit clauses  : 4
0.20/0.37	#    Positive unorientable unit clauses: 0
0.20/0.37	#    Negative unit clauses             : 4
0.20/0.37	#    Non-unit-clauses                  : 20
0.20/0.37	# Current number of unprocessed clauses: 1
0.20/0.37	# ...number of literals in the above   : 3
0.20/0.37	# Current number of archived formulas  : 0
0.20/0.37	# Current number of archived clauses   : 15
0.20/0.37	# Clause-clause subsumption calls (NU) : 40
0.20/0.37	# Rec. Clause-clause subsumption calls : 40
0.20/0.37	# Non-unit clause-clause subsumptions  : 3
0.20/0.37	# Unit Clause-clause subsumption calls : 3
0.20/0.37	# Rewrite failures with RHS unbound    : 0
0.20/0.37	# BW rewrite match attempts            : 0
0.20/0.37	# BW rewrite match successes           : 0
0.20/0.37	# Condensation attempts                : 0
0.20/0.37	# Condensation successes               : 0
0.20/0.37	# Termbank termtop insertions          : 3212
0.20/0.37	
0.20/0.37	# -------------------------------------------------
0.20/0.37	# User time                : 0.032 s
0.20/0.37	# System time              : 0.003 s
0.20/0.37	# Total time               : 0.035 s
0.20/0.37	# Maximum resident set size: 1716 pages
0.20/0.37	EOF